Image Approximation by Self Aane Fractals

نویسندگان

  • Frank Dudbridge
  • William Penney
  • Dave Sharp
  • Alan Wilson
  • Frank Devlin
  • David Fung
چکیده

This thesis describes a novel method for approximating digital images and similar data. The work is based on deterministic fractal geometry, which for some time has promised to provide new data compression techniques which may challenge existing industrial standards. However, few robust algorithms for fractal compression have hitherto been published. The present work provides enabling techniques for the eventual development of commercially applicable compression algorithms. A self-a ne fractal is a geometrically complex shape which may be speci ed with relatively little information. The problem of constructing a fractal from its de ning equations is identi ed as a forward problem, with the harder inverse of determining which equations de ne a given fractal. A new solution of the forward problem is proposed, which constructs an approximation to the fractal in optimal time. A novel scheme for assigning attributes to the elements of a fractal is then developed, which permits the representation of greytone or colour information on a fractal. This is possible through the concept of an invariant function, which has a self-similarity property analogous to that of a fractal. A method is proposed for nding invariant approximations to functions de ned on fractals. The particular case of the least-squares self-a ne approximant is derived and analysed. The technique is applied to the approximation of a greytone rectangular image block, which allows the blockwise approximation of an entire image. A novel scheme for constructing a partition of an image into adjoint rectangular blocks is proposed, based on the observation that the edge-value of a block is related to the accuracy of its fractal approximation. The partition scheme combined with the fractal approximation technique gives a prototype image compression algorithm. A brief comparison with existing algorithms con rms our methods as a feasible subject for continued development. 1 Acknowledgements I am indebted to many people for their contributions towards the success of this work. The help of my colleagues in the William Penney Lab has been much appreciated, especially that of Henry Young for his early assistance, and of Dave Wilson whose copious help and advice has been invaluable in preparing the thesis. Discussions with Dave Sharp, Alan Wilson, Frank Devlin and David Fung were of considerable help in clarifying the various ideas. The test images and their ADCT compressions were provided by the Independent Broadcasting Authority of Great Britain. Some equipment was provided by SERC Grant no. GR/H13819, \Image compression by fractal sets"; my maintenance was provided by SERC studentship number 88303797. The project was supervised by Dr D. Monro at Imperial College London. My deepest thanks are reserved for my parents, who have continued to provide unceasing support for all my activities. Finally I would like to thank the many friends I have made during the last three years, in particular the Hill eld Harriers, The Little Swing Band, Dr Ron Holder and Laura Dudbridge, all of whom have helped to make this a personally memorable and rewarding period of study. 2 Chapter

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-similar fractals and arithmetic dynamics

‎The concept of self-similarity on subsets of algebraic varieties‎ ‎is defined by considering algebraic endomorphisms of the variety‎ ‎as `similarity' maps‎. ‎Self-similar fractals are subsets of algebraic varieties‎ ‎which can be written as a finite and disjoint union of‎ ‎`similar' copies‎. ‎Fractals provide a framework in which‎, ‎one can‎ ‎unite some results and conjectures in Diophantine g...

متن کامل

Self - calibration of an A ne Camera from Multiple

A key limitation of all existing algorithms for shape and motion from image sequences under orthographic, weak perspective and para-perspective projection is that they require the calibration parameters of the camera. We present in this paper a new approach that allows the shape and motion to be computed from image sequences without having to know the calibration parameters. This approach is de...

متن کامل

Multitemporal SAR Image Compression

In this paper, we propose a new method for compressing with loss temporal series of SAR images. The algorithm requires a reference scene used as an input in the compression process. The compression is achieved through aane transformations, comparable to the ones used in fractal coding, but applied here in a non-convergent way. Blocks in the image to be compressed are deened by a non-overlapping...

متن کامل

Analysis of Fractals and Wavelets Leading to an Improved Image Compression Method

Fractal Compression relies on image self similarities at different regions . The self similarity provides an efficient way to code the image using the least possible parameters. The Wavelet Transform decomposes an image. The decomposed image is rich in self similarities. In this research we explore how the wavelet transform helps to produce a higher compression ratio when applied to the Iterate...

متن کامل

Fractals Based Clustering for CBIR

Abstract— Fractal based CBIR is based on the self similarity fundamentals of fractals. Mathematical and natural fractals are the shapes whose roughness and fragmentation neither tend to vanish, nor fluctuate, but remain essentially unchanged as one zooms in continually and examination is refined. Since an image can be characterized by its fractal code, a fractal code can therefore be used as a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992